On the prime factorization of binomial coefficients
نویسندگان
چکیده
منابع مشابه
On the Prime Factorization of Binomial Coefficients
For positive integers n and k, with n>-2k, let (k) = uv, where each prime factor of u is less than k, and each prime factor of v is at least equal to k. It is shown that u < v holds with just 12 exceptions, which are determined . If (k) = UV, where each prime factor of U is at most equal to k, and each prime factor of V is greater than k, then U< V holds with at most finitely many exceptions, 1...
متن کاملOn Prime Divisors of Binomial Coefficients
This paper, using computational and theoretical methods, deals with prime divisors of binomial coefficients: Geometric distribution and number of distinct prime divisors are studied. We give a numerical result on a conjecture by Erdôs on square divisors of binomial coefficients.
متن کاملThe Sum of Binomial Coefficients and Integer Factorization
The combinatorial sum of binomial coe cients n i r (a) := X k⌘i (mod r) ✓ n k ◆ a k has been studied widely in combinatorial number theory, especially when a = 1 and a = 1. In this paper, we connect it with integer factorization for the first time. More precisely, given a composite n, we prove that for any a coprime to n there exists a modulus r such that the combinatorial sum has a nontrivia...
متن کاملProving Infinitude of Prime Numbers Using Binomial Coefficients
We study the problem of proving in weak theories of Bounded Arithmetic the theorem that there are arbitrarily large prime numbers. We show that the theorem can be proved by some “minimal” reasoning (i.e., in the theory I∆0) using concepts such as (the logarithm) of a binomial coefficient. In fact we prove Bertrand’s Postulate (that there is at least a prime number between n and 2n, for all n > ...
متن کاملLinear Recurrence Relations for Binomial Coefficients modulo a Prime
We investigate when the sequence of binomial coefficients ( k i ) modulo a prime p, for a fixed positive integer k, satisfies a linear recurrence relation of (positive) degree h in the finite range 0 ≤ i ≤ k. In particular, we prove that this cannot occur if 2h ≤ k < p − h. This hypothesis can be weakened to 2h ≤ k < p if we assume, in addition, that the characteristic polynomial of the relatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Australian Mathematical Society
سال: 1978
ISSN: 1446-7887,1446-8107
DOI: 10.1017/s1446788700011770